Strong Normalization through Intersection Types and Memory

نویسندگان

  • Antonio Bucciarelli
  • Delia Kesner
  • Daniel Lima Ventura
چکیده

We characterize β-strongly normalizing λ-terms by means of a non-idempotent intersection type system. More precisely, we first define a memory calculus K together with a non-idempotent intersection type system K, and we show that a K-term t is typable in K if and only if t is K-strongly normalizing. We then show that β-strong normalization is equivalent to K-strong normalization. We conclude since λ-terms are strictly included in K-terms.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Syntactical Strong Normalization for Intersection Types with Term Rewriting Rules

We investigate the intersection type system of Coquand and Spiwack with rewrite rules and natural numbers and give an elementary proof of strong normalization which can be formalized in a weak metatheory.

متن کامل

An elementary proof of strong normalization for intersection types

We provide a new and elementary proof of strong normalization for the lambda calculus of intersection types. It uses no strong method, like for instance Tait-Girard reducibility predicates, but just simple induction on type complexity and derivation length and thus it is obviously formalizable within first order arithmetic. To obtain this result, we introduce a new system for intersection types...

متن کامل

Some Computational Properties of Intersection Types

This paper presents a new method for comparing computational properties of λ-terms typeable with intersection types with respect to terms typeable with Curry types. In particular, strong normalization and λ-definability are investigated. A translation is introduced from intersection typing derivations to Curry typeable terms; the main feature of the proposed technique is that the translation is...

متن کامل

Embedding intersection types into multiplicative linear logic

Intersection types characterize properties on lambda-terms such as head, weak and strong normalization. One can establish relations between intuitionistic logic and intersection types with idempotence. Here we consider a type system without idempotence and we underline common traits with intuitionistic multiplicative linear logic. We analyse head normalization to try and get properties such as ...

متن کامل

Beta-reduction as Unification Dedicated to the Memory of Professor Helena Rasiowa

We define a new unification problem, which we call β-unification and which can be used to characterize the β-strong normalization of terms in the λ-calculus. We prove the undecidability of β-unification, its connection with the system of intersection types, and several of its basic properties.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Electr. Notes Theor. Comput. Sci.

دوره 323  شماره 

صفحات  -

تاریخ انتشار 2016